On the complexity of scheduling incompatible jobs with unit-times
Identifieur interne : 000300 ( LNCS/Analysis ); précédent : 000299; suivant : 000301On the complexity of scheduling incompatible jobs with unit-times
Auteurs : Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1993.
Abstract
Abstract: We consider scheduling problems in a multiprocessor system with incompatibile jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline κ′ and a number of κ machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers κ and κ′.
Url:
DOI: 10.1007/3-540-57182-5_21
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001067
- to stream Istex, to step Curation: 000F56
- to stream Istex, to step Checkpoint: 001323
- to stream Main, to step Merge: 003170
- to stream Main, to step Curation: 002C19
- to stream Main, to step Exploration: 002C19
- to stream LNCS, to step Extraction: 000300
Links to Exploration step
ISTEX:89E872BB36C12FA78C9C5457FE3FE28909BF5CC8Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On the complexity of scheduling incompatible jobs with unit-times</title><author><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:89E872BB36C12FA78C9C5457FE3FE28909BF5CC8</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-57182-5_21</idno><idno type="url">https://api.istex.fr/document/89E872BB36C12FA78C9C5457FE3FE28909BF5CC8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001067</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001067</idno><idno type="wicri:Area/Istex/Curation">000F56</idno><idno type="wicri:Area/Istex/Checkpoint">001323</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001323</idno><idno type="wicri:doubleKey">0302-9743:1993:Bodlaender H:on:the:complexity</idno><idno type="wicri:Area/Main/Merge">003170</idno><idno type="wicri:Area/Main/Curation">002C19</idno><idno type="wicri:Area/Main/Exploration">002C19</idno><idno type="wicri:Area/LNCS/Extraction">000300</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On the complexity of scheduling incompatible jobs with unit-times</title><author><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name><affiliation wicri:level="4"><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>Department of Computer Science, Utrecht University, P.O.Box 80.089, 3508, TB Utrecht</wicri:regionArea><orgName type="university">Université d'Utrecht</orgName><placeName><settlement type="city">Utrecht</settlement><region nuts="2">Utrecht (province)</region></placeName></affiliation></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik und Informatik, Universität Trier, Postfach 3825, W-5500, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1993</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">89E872BB36C12FA78C9C5457FE3FE28909BF5CC8</idno><idno type="DOI">10.1007/3-540-57182-5_21</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We consider scheduling problems in a multiprocessor system with incompatibile jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline κ′ and a number of κ machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers κ and κ′.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Pays-Bas</li></country><region><li>Utrecht (province)</li></region><settlement><li>Utrecht</li></settlement><orgName><li>Université d'Utrecht</li></orgName></list><tree><country name="Pays-Bas"><region name="Utrecht (province)"><name sortKey="Bodlaender, Hans L" sort="Bodlaender, Hans L" uniqKey="Bodlaender H" first="Hans L." last="Bodlaender">Hans L. Bodlaender</name></region></country><country name="Allemagne"><noRegion><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000300 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000300 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:89E872BB36C12FA78C9C5457FE3FE28909BF5CC8
|texte= On the complexity of scheduling incompatible jobs with unit-times
}}
| This area was generated with Dilib version V0.6.31. |  |